Asynchronous Mobile Processes and Graph Rewriting
نویسنده
چکیده
Honda and Tokoro provide a formal system for communicating systems developed from Milner's {calculus. Unlike other formalisms, their work is based on asynchronous communication primitives. This paper proposes some minor but practically signiicant extensions to a model based on asynchronous communication and shows how the resulting system may be mapped very directly onto a graph rewriting system. While the model based on asynchronous communication permits the most direct translation , a related model using synchronous communication may be implemented in a similar manner.
منابع مشابه
A Symbolic Procedure for Control Reachability in the Asynchronous Pi-calculus: Extended Abstract
We study the relationship between the asynchronous π-calculus and the specification language MSRNC combining multiset rewriting over first-order atomic formulas (MSR) and name constraints (NC) proposed in [10]. We exploit this connection to define a sound and fully automatic procedure for attacking control reachability for infinite-state specifications given in asynchronous π-calculus, i.e., fo...
متن کاملComputer Supported Mobile Adaptive Business Processes ?
Dynamic evolution of work ow process descriptions and active instances has been an active research area since the mid 1990s. Most work has been based on ow-graph meta models formalised as variations of Petri Nets. We present a new research project on Computer Supported Mobile Adaptive Business Processes (CosmoBiz) initiated in January 2007 jointly with Microsoft Development Center Copenhagen, w...
متن کاملPrinciples of Mobile Maude
Mobile Maude is a mobile agent language extending the rewriting logic language Maude and supporting mobile computation. Mobile Maude uses reflection to obtain a simple and general declarative mobile language design and makes possible strong assurances of mobile agent behavior. The two key notions are processes and mobile objects. Processes are located computational environments where mobile obj...
متن کاملTowards Synchronous and Asynchronous Graph Transformations
Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types of graph transformations presented are formulated in the single-pushout approach to graph transformations and compared with each other. Some criteria are given to preserve or reestablish synchrony according to the deenition proposed in this paper.
متن کامل